The penalty method for random walks with uncertain energies
نویسندگان
چکیده
منابع مشابه
The penalty method for random walks with uncertain energies
We generalize the Metropolis et al. random walk algorithm to the situation where the energy is noisy and can only be estimated. Two possible applications are for long range potentials and for mixed quantum-classical simulations. If the noise is normally distributed, we are able to modify the acceptance probability by applying a penalty to the energy difference and thereby achieve exact sampling...
متن کاملA Random Walks Method for Text Classification
Practical text classification system should be able to utilize information from both expensive labelled documents and large volumes of cheap unlabelled documents. It should also easily deal with newly input samples. In this paper, we propose a random walks method for text classification, in which the classification problem is formulated as solving the absorption probabilities of Markov random w...
متن کاملBetter Random Walks for Pollard's Rho Method
We consider Pollard's rho method for discrete logarithm computation. In the analysis of its running time, the crucial assumption is made that a random walk in the underlying group is simulated. We show that this assumption does not exactly hold for the walk originally suggested by Pollard. We study alternative walks that can be eeciently applied to compute discrete logarithms. We introduce a cl...
متن کاملOn random walks for Pollard's rho method
We consider Pollard’s rho method for discrete logarithm computation. Usually, in the analysis of its running time the assumption is made that a random walk in the underlying group is simulated. We show that this assumption does not hold for the walk originally suggested by Pollard: its performance is worse than in the random case. We study alternative walks that can be efficiently applied to co...
متن کاملRandom Walks with Random Projections
Random projections have been widely used for dimensionality reduction of high dimensional problems. In this paper we show how to compute some popular random walk based proximity measures (hitting and commute times, personalized pagerank) using random projections in undirected graphs. A number of important graph-based real world applications such as image segmentation, collaborative filtering in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Chemical Physics
سال: 1999
ISSN: 0021-9606,1089-7690
DOI: 10.1063/1.478034